Extremal Graphs for Clique-Paths
نویسنده
چکیده
In this paper we deal with a Turán-type problem: given a positive integer n and a forbidden graph H , how many edges can there be in a graph on n vertices without a subgraph H? How does a graph look like if it has this extremal edge number? The forbidden graph in this article is a clique-path: a path of length k where each edge is extended to an r-clique, r ≥ 3. We determine both the extremal number and the extremal graphs for sufficiently large n.
منابع مشابه
Extremal Graphs for Blow-Ups of Cycles and Trees
The blow-up of a graph H is the graph obtained from replacing each edge in H by a clique of the same size where the new vertices of the cliques are all different. Erdős et al. and Chen et al. determined the extremal number of blow-ups of stars. Glebov determined the extremal number and found all extremal graphs for blowups of paths. We determine the extremal number and find the extremal graphs ...
متن کاملDecompositions of graphs into a given clique-extension
For r ≥ 3, a clique-extension of order r + 1 is a connected graph that consists of a Kr plus another vertex adjacent to at most r − 1 vertices of Kr. In this paper we consider the problem of finding the smallest number t such that any graph G of order n admits a decomposition into edge disjoint copies of a fixed graph H and single edges with at most t elements. Here we solve the case when H is ...
متن کاملSe p 20 12 Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number ∗
In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain the upper and lower bounds are characterized. In addition, these results disprove the two conjectures on the signless Laplacian spectral radius in [P. Hansen and C. Lucas, Bounds and conjectures for the signless Lapla...
متن کاملOn contact graphs of paths on a grid
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondance with their vertex set such that two vertices are adjacent if and only if the corresponding paths touch at a grid-point. We examine this class from a structural point of view which leads to constant upper bounds ...
متن کاملNew results on upper domatic number of graphs
For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...
متن کامل